Parameterized Complexity of Synchronization and Road Coloring
نویسندگان
چکیده
A word is called a reset word for a deterministic finite automaton if it maps all states of the automaton to a unique state. Deciding about the existence of a reset word of a given length for a given automaton is known to be a NP-complete problem. We use tools provided by Bodlaender et al. (2007) to prove that such problem, parameterized by number of states, does not admit a polynomial kernel unless polynomial hierarchy collapses. This completes the multivariate analysis of the problem started by Fernau et al. (2013).
منابع مشابه
Bounds and Fixed-Parameter Algorithms for Weighted Improper Coloring
We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by pathwidth. We generalize bounds for defective coloring to weighted improper coloring and give a bound for weighted improper coloring in terms of the sum of edge w...
متن کاملBounds and Fixed-Parameter Algorithms for Weighted Improper Coloring (Extended Version)
We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by pathwidth. We generalize bounds for defective coloring to weighted improper coloring and give a bound for weighted improper coloring in terms of the sum of edge w...
متن کاملParameterized Algorithms for Conflict-free Colorings of Graphs
In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring problem is to color the vertices of a graph using the minimum number of colors such that the coloring is conflict-free. We consider both closed neighborhoods, where the neighbor...
متن کاملA quadratic algorithm for road coloring
The road coloring theorem states that every aperiodic directed graph with constant out-degree has a synchronized coloring. This theorem had been conjectured during many years as the road coloring problem before being settled by A. Trahtman. Trahtman’s proof leads to an algorithm that finds a synchronized labeling with a cubic worst-case time complexity. We show a variant of his construction wit...
متن کاملOn the Complexity of Some Colorful Problems Parameterized by Treewidth
We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defined to be the smallest positive integer r, such that for every assignment to the vertices v of G, of a list Lv of colors, where each list has length at least r, there is a choice of one color from each vertex list Lv yielding a pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 17 شماره
صفحات -
تاریخ انتشار 2015